int searchInsert(int* nums, int numsSize, int target){
	int left = 0, right = numsSize - 1;
	while (left <= right)
	{
		int mid = left + (right - left) / 2;
		if (target > nums[mid])
			left = mid + 1;
		else if (target < nums[mid])
			right = mid - 1;
		else
			return mid;
	}
	return left;
}